#include<iostream>
#include<vector>
using namespace std;

void QuickSort(vector<int>&v,int low, int high)
{
	int i=low;
	int j=high;
	int x=v[(low+high)/2];
	while (i<j)
	{
        	while (v[i]<x) i++;
		while (v[j]>x) j--;
 		if (i<=j)
		{
			int t=v[i];
			v[i]=v[j];
			v[j]=t;
			i++; j--;
                }
	}
if (low<j) QuickSort(v,low,j);
if (i<high) QuickSort(v,i,high);
}
int main()
{
vector<int>mv;
int i;
while (1)
{
	cin>>i;
	if (i==0) break;
	mv.push_back(i);
}
QuickSort(mv,0,mv.size()-1);
for (int i=0; i<mv.size();i++)
 {
  cout<<mv[i]<<" ";
 }
return 0;
}
